翻訳と辞書 |
Moral graph A moral graph is a concept in graph theory, used to find the equivalent undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models. The moralized counterpart of a directed acyclic graph is formed by connecting nodes that have a common child, and then making all edges in the graph undirected. Equivalently, a moral graph of a directed acyclic graph ''G'' is an undirected graph in which each node of the original ''G'' is now connected to its Markov blanket. The name stems from the fact that, in a moral graph, two nodes that have a common child are required to be ''married'' by sharing an edge. == See also ==
* D-separation * Tree decomposition
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Moral graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|